Coding into a source: a direct inverse Rate-Distortion theorem
نویسندگان
چکیده
Shannon proved that if we can transmit bits reliably at rates larger than the rate distortion function R(D), then we can transmit this source to within a distortion D. We answer the converse question “If we can transmit a source to within a distortion D, can we transmit bits reliably at rates less than the rate distortion function?” in the affirmative. This can be viewed as a direct converse of the rate distortion theorem.
منابع مشابه
STA 563 : Lecture 9 – Rate Distortion Information Theory
9.1 Motivation: Quantization of Random Variables . . . . . . . . . . . . . . . . . . . . . 1 9.2 Lossy Source Coding Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 9.3 The Rate Distortion Coding Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . 4 9.3.1 Example: Binary Source . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 9.3.2 Example: Gaussian ...
متن کاملSecrecy Communication with Security Rate Measure
We introduce a new measure on secrecy, which is established based on rate-distortion theory. It is named security rate, which is the minimum (infimum) of the additional rate needed to reconstruct the source within target distortion level with any positive probability for wiretapper. It denotes the minimum distance in information metric (bits) from what wiretapper has received to any decrypted r...
متن کاملA universal source-channel separation theorem and connections between source and channel coding
An operational perspective is used to understand the relationship between source and channel coding. This is based on a direct reduction of one problem to another that uses random coding (hence common randomness) but unlike all prior work, does not involve any functional computations, in particular, no mutual-information computations. This is then used to prove a universal source-channel separa...
متن کاملSmall Robust Response-Surface Designs for Quantitative and Qualitative Factors
Alphabet Source Coding Theorem Revisited En-hui Yang and Zhen Zhang * University of Waterloo, Ontario CANADA, e-mail: [email protected] **University of Southern California, Los Angeles, CA 90089, USA, [email protected] The abstract alphabet source coding theorem is revisited. For coding at a fixed rate level, it is shown that for any fixed rate R > 0 and any memoryless abstract alphab...
متن کاملOn Lossless Quantum Data Compression and Quan- tum Variable–Length Codes
In Shannon’s Foundation of Information Theory ([27]) perhaps the most basic contributions are Source Coding Theorems (lossy and lossless) and the Channel Coding Theorem. In the most natural and simple source model DMS the source outputs a sequence X1, X2, . . . of independent, identically distributed random variables taking finitely many values. The Lossy Source Coding Theorem says that this se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0610142 شماره
صفحات -
تاریخ انتشار 2006